Nuprl Lemma : es-bound-list 11,40

es:ES, T:Type, i:Id, P:(T), Q:(ET).
(x:T. Dec(P(x)))
 (L:(T List).
 (xLe:E. Q(e,x (loc(e) = i  Id))
  (xLP(x (e:E. Q(e,x)))
  (((xL.P(x)))  e'@i.True)
  e'@i.xLP(x (e:E. (e loc e'  & Q(e,x)))) 
latex


DefinitionsDec(P), x(s), ES, False, x:AB(x), A c B, e loc e' , x(s1,s2), A, (xL.P(x)), e@i.P(e), xt(x), True, E, Id, loc(e), xLP(x), (x  l), P  Q, P & Q, P  Q, {T}, P  Q, , x:AB(x), t  T, P  Q, {i..j}, i  j < k, A  B, l[i], i j, i <z j, hd(l), i  j , ||as||, (e <loc e'), Trans(T;x,y.E(x;y))
Lemmasl exists wf, es-le-trans, es-locl wf, es-le-total, length wf1, non neg length, le wf, select member, cons member, l member wf, es-loc wf, Id wf, es-E wf, true wf, existse-at wf, not wf, l exists cons, not functionality wrt iff, implies functionality wrt iff, es-le wf, l all wf, l all nil, false wf, l exists nil, decidable wf, event system wf

origin